A Framework for Datatype Transformation
نویسندگان
چکیده
We study one dimension of program evolution, namely the evolution of the datatypes in a program. Both the object programs subject to datatype transformation, and the meta-programs for transformation are functional programs. We cover (semantics-preserving) refactorings, but also structure-extending and -reducing transformations. A corresponding operator suite is designed, a suitable specification approach is worked out, and interactive datatype transformation is enabled. We call the corresponding framework FDT—Framework for Datatype Transformation. We make a number of observations on what specification and interaction techniques are appropriate for datatype transformation, and how it relates to the overall theme of software evolution.
منابع مشابه
Software ENgineering A Framework for Datatype Transformation
We study one dimension in program evolution, namely the evolution of the datatype declarations in a program. To this end, a suite of basic transformation operators is designed. We cover structure-preserving refactorings, but also structure-extending and -reducing adaptations. Both the object programs that are subject to datatype transformations, and the meta programs that encode datatype transf...
متن کاملSteps towards Mechanizing Program Transformations Using Pvs ?
PVS is a highly automated framework for speciication and veriication. We show how the language and deduction features of PVS can be used to formalize, mechanize , and apply some useful program transformation techniques. We examine two such examples in detail. The rst is a fusion theorem due to Bird where the composition of a catamorphism (a recursive operation on the structure of a datatype) an...
متن کاملSteps Toward Mechanizing Program Transformations Using PVS
PVS is a highly automated framework for speciication and veriication. We show how the language and deduction features of PVS can be used to formalize, mechanize , and apply some useful program transformation techniques. We examine two such examples in detail. The rst is a fusion theorem due to Bird where the composition of a catamorphism (a recursive operation on the structure of a datatype) an...
متن کاملTesting for linearizability
Linearizability is a well-established correctness condition for concurrent datatypes. Informally, a concurrent datatype is linearizable if operation calls appear to have an effect, one at a time, in an order that is consistent with a sequential (specification) datatype, with each operation taking effect between the point at which it is called and when it returns. We present a testing framework ...
متن کاملA Scheme for Integrating Datatype Groups into Description Logics
Existing ontology-related formalisms focus on either datatypes (such as the OWL datatype formalism) or datatype predicates (such as the concrete domain approach). Furthermore, they don’t provide a general framework for representing customised datatypes and predicates, which is identified as a key requirement of ontology languages. In this paper we shall propose a scheme for integrating concept ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 82 شماره
صفحات -
تاریخ انتشار 2003